On a Planar Variant of the Kakeya Problem

نویسنده

  • KEITH M. ROGERS
چکیده

An (n − 2)–dimensional smooth manifold in Gr(n, 2) is said to be curved if its restriction to each m–space of R is no more than (m − 2)– dimensional. A K 2 -set is a set of zero Lebesgue measure containing a translate of every plane in a curved manifold. We show that this is a natural class of sets with respect to the Kakeya problem and prove that dimH(E) ≥ 7/2 for all K 2 -sets E. When the underlying field is replaced by C, we get dimH(E) ≥ 7 for all K 2 -sets over C, and we construct an example to show that this is sharp. Thus K 2 -sets over C do not necessarily have full Hausdorff dimension.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Enhanced ACS algorithms for plastic analysis of planar frames

In recent years, the trend in solving optimization problems has been directed toward using heuristic algorithms such as neural networks, genetic and ant colony algorithms. The main reason for this trend can be attributed to the fact that these algorithms can be efficiently adjusted to the specific search space to which they are applied and consequently they can be used for many optimization pro...

متن کامل

PLASTIC ANALYSIS OF PLANAR FRAMES USING CBO AND ECBO ALGORITHMS

In rigid plastic analysis one of the most widely applicable methods that is based on the minimum principle, is the combination of elementary mechanisms which uses the upper bound theorem. In this method a mechanism is searched which corresponds to the smallest load factor. Mathematical programming can be used to optimize this search process for simple fra...

متن کامل

Forward kinematic analysis of planar parallel robots using a neural network-based approach optimized by machine learning

The forward kinematic problem of parallel robots is always considered as a challenge in the field of parallel robots due to the obtained nonlinear system of equations. In this paper, the forward kinematic problem of planar parallel robots in their workspace is investigated using a neural network based approach. In order to increase the accuracy of this method, the workspace of the parallel robo...

متن کامل

Optimization of the Kinematic Sensitivity and the Greatest Continuous Circle in the Constant-orientation Workspace of Planar Parallel Mechanisms

This paper presents the results of a comprehensive study on the efficiency of planar parallel mechanisms, considering their kinetostatic performance and also, their workspace. This aim is approached upon proceeding single- and multi-objective optimization procedures. Kinetostatic performances of ten different planar parallel mechanisms are analyzed by resorting to a recent index, kinematic sens...

متن کامل

The Kakeya problem: a gap in the spectrum and classification of the smallest examples

Kakeya sets in the affine plane AG(2, q) are point sets that are the union of lines, one through every point on the line at infinity. The finite field Kakeya problem asks for the size of the smallest Kakeya sets and the classification of these Kakeya sets. In this article we present a new example of a small Kakeya set and we give the classification of the smallest Kakeya sets up to weight q(q+2...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008